11![Privacy-Preserving Set Operations Lea Kissner Dawn Song Privacy-Preserving Set Operations Lea Kissner Dawn Song](https://www.pdfsearch.io/img/fca7dc2af5f5d78212396621434e3891.jpg) | Add to Reading ListSource URL: www.cs.cmu.eduLanguage: English - Date: 2006-11-19 16:59:50
|
---|
12![Circuits with Arbitrary Gates for Random Operators ∗ S. Jukna G. Schnitger Circuits with Arbitrary Gates for Random Operators ∗ S. Jukna G. Schnitger](https://www.pdfsearch.io/img/2715b600b970c93c6da43074449cc670.jpg) | Add to Reading ListSource URL: lovelace.thi.informatik.uni-frankfurt.deLanguage: English - Date: 2010-04-30 12:55:41
|
---|
13![R Foundations and Trends
in Theoretical Computer Science Vol. 9, No–123 c 2013 S. Jukna and I. Sergeev R Foundations and Trends
in Theoretical Computer Science Vol. 9, No–123 c 2013 S. Jukna and I. Sergeev](https://www.pdfsearch.io/img/4fab215f002cb2a2342e5c5cb6e17b28.jpg) | Add to Reading ListSource URL: lovelace.thi.informatik.uni-frankfurt.deLanguage: English - Date: 2014-01-24 16:28:13
|
---|
14![ON DEFINING INTEGERS AND PROVING ARITHMETIC CIRCUIT LOWER BOUNDS ¨rgisser Peter Bu Abstract. Let τ (n) denote the minimum number of arithmetic operations sufficient to build the integer n from the constant 1. We prove ON DEFINING INTEGERS AND PROVING ARITHMETIC CIRCUIT LOWER BOUNDS ¨rgisser Peter Bu Abstract. Let τ (n) denote the minimum number of arithmetic operations sufficient to build the integer n from the constant 1. We prove](https://www.pdfsearch.io/img/2b59d6960c0872276e95f7cd642dac4d.jpg) | Add to Reading ListSource URL: math-www.uni-paderborn.deLanguage: English - Date: 2007-06-22 04:55:31
|
---|
15![Improved Complexity Bounds for Computing with Planar Algebraic Curves Alexander Kobel1–3 Michael Sagraloff1 Improved Complexity Bounds for Computing with Planar Algebraic Curves Alexander Kobel1–3 Michael Sagraloff1](https://www.pdfsearch.io/img/fe586ad2d0a72027b990d1da6d8fc96e.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2014-01-22 20:37:59
|
---|
16![Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko Feebly secure cryptographic primitives∗ Edward A. Hirsch Olga Melanich Sergey I. Nikolenko](https://www.pdfsearch.io/img/eb5021dbd19d83743dec0d296893ab89.jpg) | Add to Reading ListSource URL: logic.pdmi.ras.ruLanguage: English - Date: 2012-01-21 00:18:10
|
---|
17![Weil Image Sums (and some related problems) September , ver. . Weil Image Sums (and some related problems) September , ver. .](https://www.pdfsearch.io/img/81969210ce7fab193453c5e0f99ca28a.jpg) | Add to Reading ListSource URL: www.untruth.orgLanguage: English - Date: 2012-02-29 00:47:43
|
---|
18![Light Up is NP-complete Brandon McPhail February 28, 2005 Light Up is NP-complete Brandon McPhail February 28, 2005](https://www.pdfsearch.io/img/fb40b606e94e4330624e7db92e9e6cba.jpg) | Add to Reading ListSource URL: people.cs.umass.eduLanguage: English - Date: 2007-09-02 12:14:45
|
---|